genetic algorithm and simulated annealing for redundancy allocation problem with cold-standby strategy

Authors

aida karimi

mani sharifi

amirhossain chambari

abstract

this paper presents a new mathematical model for a redundancyallocation problem (rap) withcold-standby redundancy strategy and multiple component choices.the applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hypo-exponential and exponential distributionare investigated. the goal of the rap is to select available components and redundancy level for each subsystem for maximizing system reliability under cost and weight constraints.sincethe proposed model belongs to np-hard class, we proposed two metaheuristic algorithms; namely, simulated annealing and genetic algorithm to solve it. in addition, a numerical example is presented to demonstrate the application of the proposed solution methodology.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Genetic Algorithm and Simulated Annealing for Redundancy Allocation Problem with Cold-standby Strategy

This paper presents a new mathematical model for a redundancyallocation problem (RAP) withcold-standby redundancy strategy and multiple component choices.The applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.Manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hy...

full text

A Memtic genetic algorithm for a redundancy allocation problem

Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...

full text

Cold-standby redundancy allocation problem with degrading components

Components in cold-standby state are usually assumed to be as good as new when they are activated. However, even in a standby environment, the components will suffer from performance degradation. This article presents a study of a redundancy allocation problem (RAP) for cold-standby systems with degrading components. The objective of the RAP is to determine an optimal design configuration of co...

full text

Solving Redundancy Allocation Problem with Repairable Components Using Genetic Algorithm and Simulation Method

Reliability optimization problem has a wide application in engineering area. One of the most important problems in reliability is redundancy allocation problem (RAP). In this research, we worked on a RAP with repairable components and k-out-of-n sub-systems structure. The objective function was to maximize system reliability under cost and weight constraints. The aim was determining optimal com...

full text

Redundancy Allocation Problem of a System with Three-state Components: A Genetic Algorithm (RESEARCH NOTE)

The redundancy allocation is one of the most important and useful problems in system optimization, especially in electrical and mechanical systems. The object of this problem is to maximize system reliability or availability within a minimum operation cost. Many works have been proposed in this area so far to draw the problem near to real-world situations. While in classic models the system com...

full text

A new Simulated Annealing algorithm for the robust coloring problem

The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...

full text

My Resources

Save resource for easier access later


Journal title:
journal of optimization in industrial engineering

Publisher: qiau

ISSN 2251-9904

volume Volume 4

issue 8 2011

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023